Lower Bound of the Size of OBDDs Representing Division
نویسندگان
چکیده
In various elds of computer science, it is often required to represent Boolean functions succinctly and to manipulate them e ciently. An Ordered Binary Decision Diagram (OBDD) [1, 2] is a directed acyclic graph representing a Boolean function. OBDDs have the following properties. 1) For a given variable ordering, OBDDs have a reduced canonical form for each Boolean function. 2) Many practical Boolean functions are represented in feasible size. 3) There are e cient algorithms for Boolean operations on OBDDs. According to these good properties, OBDDs are widely used for various applications, especially in computer-aided design and veri cation of digital systems.
منابع مشابه
KUIS - 96 - 0002 An Exponential Lower Bound of the Size of OBDDs
The size of the Ordered Binary Decision Diagram (OBDD) which represents a Boolean function greatly depends on the ordering of input variables. In this paper, we show that the size of the OBDD representing n-bits integer division is (2 n=8 ) even if any variable ordering is allowed to minimize the size of the OBDD. We also show that _-OBDDs and ^-OBDDs representing division have the same lower b...
متن کاملAn Exponential Lower Bound of the Size of OBDDs Representing Division
1 Introduction The size of an OBDD [1] largely depends on the variable ordering. It is important to clarify the lower bounds of OBDDs representing arithmetic functions. In this report, we investigate a lower bound of the size of OBDDs representing integer division. More precisely, we focus on each bit of the output of the n-bit / n-bit division, and prove that the size of OBDDs representing the...
متن کاملExponential Lower Bounds on the Size ofOBDDs Representing
An Ordered Binary Decision Diagram (OBDD) is a directed acyclic graph representing a Boolean function. The size of OBDDs largely depends on the variable ordering. In this paper, we show the size of the OBDD representing the i-th bit of the output of n-bit/n-bit integer division is (2 (n?i)=8) for any variable ordering. We also show that _-OBDDs, ^-OBDDs and-OBDDs representing integer division h...
متن کاملA Lower Bound for Randomized Read-k-Times Branching Programs
In this paper, we are concerned with randomized OBDDs and randomized read-k-times branching programs. We present an example of a Boolean function which has polynomial size randomized OBDDs with small, one-sided error, but only non-deterministic read-once branching programs of exponential size. Furthermore, we discuss a lower bound technique for randomized OBDDs with two-sided error and prove an...
متن کاملOn OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables
In 2004 Atserias, Kolaitis and Vardi proposed OBDD-based propositional proof systems that prove unsatisfiability of a CNF formula by deduction of identically false OBDD from OBDDs representing clauses of the initial formula. All OBDDs in such proofs have the same order of variables. We initiate the study of OBDD based proof systems that additionally contain a rule that allows to change the orde...
متن کامل